Identification of repeat structure in large genomes using repeat probability clouds
نویسندگان
چکیده
منابع مشابه
Identification of repeat structure in large genomes using repeat probability clouds.
The identification of repeat structure in eukaryotic genomes can be time-consuming and difficult because of the large amount of information ( approximately 3 x 10(9) bp) that needs to be processed and compared. We introduce a new approach based on exact word counts to evaluate, de novo, the repeat structure present within large eukaryotic genomes. This approach avoids sequence alignment and sim...
متن کاملDe novo identification of repeat families in large genomes
MOTIVATION De novo repeat family identification is a challenging algorithmic problem of great practical importance. As the number of genome sequencing projects increases, there is a pressing need to identify the repeat families present in large, newly sequenced genomes. We develop a new method for de novo identification of repeat families via extension of consensus seeds; our method enables a r...
متن کاملIdentification of Linked Markers for Delayed Fruit Ripening in Tomato Using Simple Sequence Repeat (SSR) Markers
Tomato (Solanum lycopersicum L.) is an important vegetable crop and acts as model plant for fruit development studies. Besides that, post-harvest damage is a devastating phenomenon often associated with ripening process in tomato which in turn leads to greater yield loss. Understanding the genetics, molecular and biochemical pathways is the key to overcome the existing situation. In th...
متن کاملDetecting Repeat Families in Incompletely Sequenced Genomes
Repeats form a major class of sequence in genomes with implications for functional genomics and practical problems. Their detection and analysis pose a number of challenges in genomic sequence analysis, especially if the genome is not completely sequenced. The most abundant and evolutionary active forms of repeats are found in the form of families of long similar sequences. We present a novel m...
متن کاملRime: Repeat identification
We present an algorithm for detecting long similar fragments occurring at least twice in a set of biological sequences. The problem becomes computationally challenging when the frequency of a repeat is allowed to increase and when a non-negligible number of insertions, deletions and substitutions are allowed. We introduce in this paper an algorithm, Rime1 (for Repeat Identification: long, Multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analytical Biochemistry
سال: 2008
ISSN: 0003-2697
DOI: 10.1016/j.ab.2008.05.015